package com.cloud.leetcode;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class binary_search {


    public static void main(String[] args) {
        List<Integer> intList = new ArrayList<>();
        for (int i = 1; i <= 100; i++) {
            intList.add(i);
        }

        Scanner scanner = new Scanner(System.in);
        String s = scanner.nextLine();
        int num = Integer.valueOf(s);


    }

    public Integer cal(Integer guess, List<Integer> numList) {
        int size = numList.size();
        int mid = size / 2;
        int number = numList.get(mid);
        if (number == guess) {
            System.out.println("恭喜你，猜中了！");
            return 9999;
        } else if (number < guess) {
            int result = Math.round(mid/2);
            return result;
        } else if (number > guess) {

        }

        return guess;
    }
}
